<HTML><HEAD><TITLE>Algorithms</TITLE></HEAD><BODY>[ <A HREF="index.html">Reference Manual</A> | <A HREF="fullindex.html">Alphabetic Index</A> ]
<H1>Algorithms</H1><DL>
<DT><A HREF="lib_public/all_min_cuts/index.html"><STRONG>all_min_cuts</STRONG></A></DT>
<DD>Curet et al, algorithm for generating all minimum-cost cuts</DD>
<DT><A HREF="lib_public/all_min_cuts_eplex/index.html"><STRONG>all_min_cuts_eplex</STRONG></A></DT>
<DD>Mixed integer programming solution for generating all minimum-cost cuts</DD>
<DT><A HREF="lib/anti_unify/index.html"><STRONG>anti_unify</STRONG></A></DT>
<DD>Computes the most specific generalization of two terms</DD>
<DT><A HREF="lib/apply/index.html"><STRONG>apply</STRONG></A></DT>
<DD>The apply/2 higher-order predicate</DD>
<DT><A HREF="lib/apply_macros/index.html"><STRONG>apply_macros</STRONG></A></DT>
<DD>Utilities to apply a predicate to all elements of a list resp. all subterms of a term</DD>
<DT><A HREF="lib/bfs/index.html"><STRONG>bfs</STRONG></A></DT>
<DD>Best-first search library</DD>
<DT><A HREF="lib/branch_and_bound/index.html"><STRONG>branch_and_bound</STRONG></A></DT>
<DD>Generic branch-and-bound primitives</DD>
<DT><A HREF="lib/calendar/index.html"><STRONG>calendar</STRONG></A></DT>
<DD>Routines for calendar computations, based on modified julian dates (MJD).</DD>
<DT><A HREF="lib/changeset/index.html"><STRONG>changeset</STRONG></A></DT>
<DD>Compute sets of modified variables</DD>
<DT><A HREF="lib/colgen/index.html"><STRONG>colgen</STRONG></A></DT>
<DD>Column generation library</DD>
<DT><A HREF="lib/edge_finder/index.html"><STRONG>edge_finder</STRONG></A></DT>
<DD>Quadratic edge-finder algorithm for disjunctive and cumulative constraints for FD</DD>
<DT><A HREF="lib/edge_finder3/index.html"><STRONG>edge_finder3</STRONG></A></DT>
<DD>Cubic edge-finder algorithm for disjunctive and cumulative constraints for FD</DD>
<DT><A HREF="lib/graph_algorithms/index.html"><STRONG>graph_algorithms</STRONG></A></DT>
<DD>Collection of graph algorithms</DD>
<DT><A HREF="lib_public/ic_global_gac/index.html"><STRONG>ic_global_gac</STRONG></A></DT>
<DD>Library of global constraints which achieve generalized arc consistency</DD>
<DT><A HREF="lib_public/max_flow/index.html"><STRONG>max_flow</STRONG></A></DT>
<DD>Ford-Fulkerson maximum flow algorithm</DD>
<DT><A HREF="lib_public/max_flow_eplex/index.html"><STRONG>max_flow_eplex</STRONG></A></DT>
<DD>Linear programming solution for maximum flow problem</DD>
<DT><A HREF="lib/notinstance/index.html"><STRONG>notinstance</STRONG></A></DT>
<DD>Constraints for structural equality and subsumption</DD>
<DT><A HREF="lib/numbervars/index.html"><STRONG>numbervars</STRONG></A></DT>
<DD>C-Prolog style numbervars predicate</DD>
<DT><A HREF="lib/par_util/index.html"><STRONG>par_util</STRONG></A></DT>
<DD>Parallel versions of various predicates</DD>
<DT><A HREF="lib/regex/index.html"><STRONG>regex</STRONG></A></DT>
<DD>Interface to POSIX regular expression handling</DD>
<DT><A HREF="lib/suspend/index.html"><STRONG>suspend</STRONG></A></DT>
<DD>Lazy-checking versions of arithmetic primitives, and the suspend-attribute</DD>
<DT><A HREF="lib/tentative_constraints/index.html"><STRONG>tentative_constraints</STRONG></A></DT>
<DD>Tentative value implementations for some basic constraints</DD>
</DL>
<HR>Generated 2009-05-27 01:25
</BODY></HTML>
